ℓ1 Major Component Detection and Analysis (ℓ1 MCDA): Foundations in Two Dimensions

نویسندگان

  • Ye Tian
  • Qingwei Jin
  • John E. Lavery
  • Shu-Cherng Fang
چکیده

Principal Component Analysis (PCA) is widely used for identifying the major components of statistically distributed point clouds. Robust versions of PCA, often based in part on the l norm (rather than the l norm), are increasingly used, especially for point clouds with many outliers. Neither standard PCA nor robust PCAs can provide, without additional assumptions, reliable information for outlier-rich point clouds and for distributions with several main directions (spokes). We carry out a fundamental and complete reformulation of the PCA approach in a framework based exclusively on the l norm and heavy-tailed distributions. The l Major Component Detection and Analysis (l MCDA) that we propose can determine the main directions and the radial extent of 2D data from single or multiple superimposed Gaussian or heavy-tailed distributions without and with patterned artificial outliers (clutter). In nearly all cases in the computational results, 2D l MCDA has accuracy superior to that of standard PCA and of two robust PCAs, namely, the projection-pursuit method of Croux and Ruiz-Gazen and the l factorization method of Ke and Kanade. (Standard PCA is, of course, superior to l MCDA for Gaussian-distributed point clouds.) The computing time of l MCDA is competitive with the computing times of the two robust PCAs. Algorithms 2013, 6 13

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

- Penalized Quantile Regression in High - Dimensional Sparse Models

We consider median regression and, more generally, quantile regression in high-dimensional sparse models. In these models the overall number of regressors p is very large, possibly larger than the sample size n, but only s of these regressors have non-zero impact on the conditional quantile of the response variable, where s grows slower than n. Since in this case the ordinary quantile regressio...

متن کامل

MR Image Reconstruction Using Block Matching and Adaptive Kernel Methods

An approach to Magnetic Resonance (MR) image reconstruction from undersampled data is proposed. Undersampling artifacts are removed using an iterative thresholding algorithm applied to nonlinearly transformed image block arrays. Each block array is transformed using kernel principal component analysis where the contribution of each image block to the transform depends in a nonlinear fashion on ...

متن کامل

A Reweighted ℓ1-Minimization Based Compressed Sensing for the Spectral Estimation of Heart Rate Variability Using the Unevenly Sampled Data

In this paper, a reweighted ℓ1-minimization based Compressed Sensing (CS) algorithm incorporating the Integral Pulse Frequency Modulation (IPFM) model for spectral estimation of HRV is introduced. Knowing as a novel sensing/sampling paradigm, the theory of CS asserts certain signals that are considered sparse or compressible can be possibly reconstructed from substantially fewer measurements th...

متن کامل

Estimation and Selection via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications

The ℓ1-penalized method, or the Lasso, has emerged as an important tool for the analysis of large data sets. Many important results have been obtained for the Lasso in linear regression which have led to a deeper understanding of high-dimensional statistical problems. In this article, we consider a class of weighted ℓ1-penalized estimators for convex loss functions of a general form, including ...

متن کامل

An ADMM algorithm for solving ℓ1 regularized MPC

[1] M. Gallieri, J. M. Maciejowski “lasso MPC: Smart Regulation of OverActuated Systems”, to appear in ACC 2012. [2] M. Annergren, A. Hansson, B. Wahlberg “An ADMM Algorithm for Solving l1 Regularized MPC”, submitted. [3] S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein “Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers”, Foundations and Tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Algorithms

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2013